منابع مشابه
Branch-Price-and-Cut Algorithms
In many mixed integer programs there is some embedded problem structure which can be exploited, often by a decomposition. When the relaxation in each node of a branch-andbound tree is solved by column generation, one speaks of branch-and-price. Optionally, cutting planes can be added in order to strengthen the relaxation, and this is called branchprice-and-cut. We introduce the common concepts ...
متن کاملBranch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generated dynamically throughout the search tree. The ability to handle constantly changing sets of cuts and variables allows these algorithms to undertake the solution of very large-scale DOPs; however, it also leads to int...
متن کاملBranch-and-Cut-and-Price for Capacitated Connected Facility Location
We consider a generalization of the Connected Facility Location problem (ConFL), suitable to model real world network extension scenarios such as fiber-tothe-curb. In addition to choosing a set of facilities and connecting them by a Steiner tree as in ConFL, we aim to maximize the resulting profit by potentially supplying only a subset of all customers. Furthermore, capacity constraints on pote...
متن کاملThe Anatomy of a Price Cut: Discovering Organizational Sources of the Costs of Price Adjustment*
We use qualitative data to analyze the key elements of the price adjustment processes used at a large industrial manufacturer and several of its major customers. We focus on a specific episode, a price cut, which most vividly exemplifies the themes that emerge from our data. In the specific episode, market forces clearly dictate that the firm should cut prices, and everyone in the firm agrees w...
متن کاملParallel branch, cut, and price for large-scale discrete optimization
In discrete optimization, most exact solution approaches are based on branch and bound, which is conceptually easy to parallelize in its simplest forms. More sophisticated variants, such as the so-called branch, cut, and price algorithms, are more difficult to parallelize because of the need to share large amounts of knowledge discovered during the search process. In the first part of the paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1970
ISSN: 0028-0836,1476-4687
DOI: 10.1038/227205b0